Statistical Automaton for Verifying Temporal Properties and Computing Information on Traces
نویسندگان
چکیده
Verification is decisive for embedded software. The goal of this work is to verify temporal properties on industrial applications, with the help of formal dynamic analysis. The approach presented in this paper is composed of three steps: formalization of temporal properties using an adequate language, generation of execution traces from a given property and verification of this property on execution traces. This paper focuses on the verification step. Use of a new kind of Büchi automaton has been proposed to provide an efficient verification taking into account the industrial needs and constraints. A prototype has been developed and used to carry out experiments on different anonymous real industrial applications.
منابع مشابه
The relationship between CSP, FDR and Büchi automata
Two long standing approaches to specifying and verifying properties of finite-state systems are Büchi automata, which are specialised for reasoning about infinite traces, and the combination of CSP and its refinement checker FDR, which offer some scope for reasoning about infinite traces in addition to capturing a wide variety of finitely observable behaviour. In this paper we demonstrate that ...
متن کاملClocked Transition Systems ?
This paper presents a new computational model for realtime systems, called the clocked transition system model. The model is a development of our previous timed transition model, where some of the changes are inspired by the model of timed automata. The new model leads to a simpler style of temporal speci cation and veri cation, requiring no extension of the temporal language. For verifying saf...
متن کاملVerification of Durational Action Timed Automata using UPPAAL
The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods. The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic) on real-time systems. The system behavi...
متن کاملUnderstanding the Timed Distributed Trace of a Partially Synchronous System at Runtime
It has gained broad attention to understand the timed distributed trace of a cyber-physical system at runtime, which is often achieved by verifying properties over the observed trace of system execution. However, this verification is facing severe challenges. First, in realistic settings, the computing entities only have imperfectly synchronized clocks. A proper timing model is essential to the...
متن کاملChecking Finite Traces using Alternating Automata
Alternating automata have been commonly used as a basis for static verification of reactive systems. In this paper we show how alternating automata can be used in runtime verification. We present three algorithms to check at runtime whether a reactive program satisfies a temporal specification, expressed by a lineartime temporal logic formula. The three methods start from the same alternating a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016